Symmetric 0–1 matrices with inverses having two distinct values and constant diagonal

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular symmetric Hadamard matrices with constant diagonal

We survey constructions of regular symmetric Hadamard matrices with constant diagonal, and point out some errors in the literature.

متن کامل

On Constructing Matrices with Prescribed Singular Values and Diagonal Elements

Similar to the well known Schur Horn theorem that characterizes the relationship between the diagonal entries and the eigenvalues of a Hermitian matrix the Sing Thompson theorem characterizes the relationship between the diagonal en tries and the singular values of an arbitrary matrix It is noted in this paper that based on the induction principle such a matrix can be constructed numerically by...

متن کامل

Graph Embeddings, Symmetric Real Matrices, and Generalized Inverses

Graph embedding techniques for bounding eigenvalues of associated matrices have a wide range of applications. The bounds produced by these techniques are not in general tight, however, and may be off by a log n factor for some graphs. Guattery and Miller showed that, by adding edge directions to the graph representation, they could construct an embedding called the current flow embedding, which...

متن کامل

Inverses of symmetric, diagonally dominant positive matrices and applications

We prove tight bounds for the ∞-norm of the inverse of a symmetric, diagonally dominant positive matrix J ; in particular, we show that ‖J‖∞ is uniquely maximized among all such J . We also prove a new lower-bound form of Hadamard’s inequality for the determinant of diagonally dominant positive matrices and an improved upper bound for diagonally balanced positive matrices. Applications of our r...

متن کامل

Characterization of symmetric M-matrices as resistive inverses

We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do this we consider the network defined by the off-diagonal entries of the matrix and we identify the matrix with a positive definite Schrödinger operator which ground state is determined by the lowest ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2016

ISSN: 0024-3795

DOI: 10.1016/j.laa.2015.02.019